Service resource allocation

ABSTRACT

Disclosed are various embodiments for a resource allocation application. Usage data for application program interfaces is aggregated over time. Limits for an allocation of resources for each of the application program interfaces are calculated as a function of the usage data. Limits are recalculated as new application program interfaces are added.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of and claims priority to U.S.application Ser. No. 13/705,363 titled “Service Resource Allocation”,filed Dec. 5, 2012, which is incorporated herein by reference in itsentirety.

BACKGROUND

Services may share a pool of available resources to perform theirfunctions. Problems arise when resource distributions result in serviceunavailability.

BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the present disclosure can be better understood withreference to the following drawings. The components in the drawings arenot necessarily to scale, with emphasis instead being placed uponclearly illustrating the principles of the disclosure. Moreover, in thedrawings, like reference numerals designate corresponding partsthroughout the several views.

FIG. 1 is a drawing of a networked environment according to variousembodiments of the present disclosure.

FIG. 2 is a flowchart illustrating one example of functionalityimplemented as portions of a resource allocation application executed ina computing environment in the networked environment of FIG. 1 accordingto various embodiments of the present disclosure.

FIG. 3 is a flowchart illustrating one example of functionalityimplemented as portions of resource allocation application executed in acomputing environment in the networked environment of FIG. 1 accordingto various embodiments of the present disclosure.

FIG. 4 is a flowchart illustrating one example of functionalityimplemented as portions of resource allocation application executed in acomputing environment in the networked environment of FIG. 1 accordingto various embodiments of the present disclosure.

FIG. 5 is a schematic block diagram that provides one exampleillustration of a computing environment employed in the networkedenvironment of FIG. 1 according to various embodiments of the presentdisclosure.

DETAILED DESCRIPTION

Computing resources are often shared amongst many executed services.Examples of resources may include threads, disk space, networkbandwidth, or other resources. When a service or an application programinterface (API) of a service uses an excessive amount of resources, itmay leave the other services or APIs lacking in resources. This resultsin unavailability for clients attempting to access the services or APIs.

Limits can be imposed with respect to the APIs in order to prevent oneAPI from monopolizing the resource pool. Manually implemented limitshave several disadvantages. As static values, the manually implementedlimits cannot adjust to changes in a dynamic computing environment.Limits cannot be increased in periods of available system capacity, andcannot be decreased to account for API unavailability. Additionally, asnew APIs that access the same resource pool are added, new limits mustbe imposed across all APIs which increases the administrator workload.

A resource allocation application dynamically determines resourceallocation limits with respect to the APIs. The limits are recalculatedas new APIs are added. The limits may be calculated as a function ofpast usage data with respect to the individual APIs, priority tiersassigned to the APIs, or other data. Additionally, resource limits canbe reallocated between subsets of APIs in periods of high systemcapacity or heavy transaction loads on the APIs.

In the following discussion, a general description of the system and itscomponents is provided, followed by a discussion of the operation of thesame.

With reference to FIG. 1, shown is a networked environment 100 accordingto various embodiments. The networked environment 100 includes acomputing environment 101 and a client 104, which are in datacommunication with each other via a network 107. The network 107includes, for example, the Internet, intranets, extranets, wide areanetworks (WANs), local area networks (LANs), wired networks, wirelessnetworks, or other suitable networks, etc., or any combination of two ormore such networks.

The computing environment 101 may comprise, for example, a servercomputer or any other system providing computing capability.Alternatively, the computing environment 101 may employ a plurality ofcomputing devices that may be employed that are arranged, for example,in one or more server banks or computer banks or other arrangements.Such computing devices may be located in a single installation or may bedistributed among many different geographical locations. For example,the computing environment 101 may include a plurality of computingdevices that together may comprise a cloud computing resource, a gridcomputing resource, and/or any other distributed computing arrangement.In some cases, the computing environment 101 may correspond to anelastic computing resource where the allotted capacity of processing,network, storage, or other computing-related resources may vary overtime.

Various applications and/or other functionality may be executed in thecomputing environment 101 according to various embodiments. Also,various data is stored in a data store 1111 that is accessible to thecomputing environment 101. The data store 111 may be representative of aplurality of data stores 111 as can be appreciated. The data stored inthe data store 111, for example, is associated with the operation of thevarious applications and/or functional entities described below.

The components executed on the computing environment 101, for example,include a resource allocation application 114 and services 117, andother applications, services, processes, systems, engines, orfunctionality not discussed in detail herein. The resource allocationapplication 114 is executed to calculate resource allocation limits 121for APIs 124 of the services 117, thereby limiting an amount ofresources 127 available to execute the functionality implemented in theAPIs 124. The resource allocation application 114 may also facilitatethe allocation of the resources 127 to the APIs 124 as a function of theresource allocation limits 121.

The resource allocation limits 121 may be calculated as a function ofusage data 131 of the APIs 124. Usage data 131 may comprise, forexample, an amount of transactions per second executed with respect to acorresponding one of the APIs over a period of time. Usage data 131 mayalso comprise an amount of processing power, network bandwidth, diskreads, disk writes, socket connections, database connections, or otherdata used over a period of time. The usage data 131 may compriseaggregates of the data over a time period, samples taken at predefinedintervals, or other information. The usage data 131 may be generated bya data sampling or aggregation agent, generated as a function of log orrecord data, or generated by some other approach.

In embodiments in which the resource allocation limits 121 arecalculated as a function of usage data 131, the resource allocationapplication 114 may calculate an aggregate value with respect to theusage data 131. For example, in calculating a resource allocation limit121 for an API 124, the resource allocation application 114 maycalculate an average transactions per second as a function of sampledtransactions per second embodied in the usage data 131.

Additionally, the resource allocation application 114 may calculate aweighted average of the usage data 131. Weights assigned to the usagedata 131 may be a function of the age of the usage data 131. Forexample, older usage data 131 may be weighted higher than newer usagedata 131. Conversely, newer usage data 131 may be weighted higher thanolder usage data 131. Weighted averages of the usage data 131 may becalculated by other approaches as well. Other aggregate functions suchas minimums, maximums, summations, or other aggregate functions may alsobe used to calculate the resource allocation limit 121 as a function ofthe usage data 131.

The resource allocation application 114 may calculate the resourceallocation limits 121 as a function of priority tiers assigned to theAPIs 124. As a non-limiting example, each of the APIs 124 may beassigned one of a high, medium, and low priority tier. In such anembodiment the corresponding one of the resource allocation limits 121may be calculated as being higher for high tier APIs 124 and lower forlow tier APIs 124. The resource allocation application 114 may alsocalculate the resource allocation limits 121 by another approach.

The resource allocation application 114 may recalculate the resourceallocation limits 121 in response to an event, a predefined condition,or other criteria. For example, the resource allocation application 114may recalculate the resource allocation limits 121 in response to a newAPI 124 being added to a set of APIs 124 associated with the sameservice 117 or sharing the same pool of resources 127. The resourceallocation application 114 may recalculate the resource allocationlimits 121 in response to input from a user or administrator of thecomputing environment 101, a state of resource 127 usage, or in responseto another event or condition.

In some embodiments, the resource allocation application 114 may performa reallocation of resource allocation limits 121 for a subset of theAPIs 124. For example, a first API 124 may “steal” a portion of theresource allocation limit 121 corresponding to a second API 124. Thiscomprises increasing the resource allocation limit 121 corresponding tothe first API 124 and decreasing the resource allocation limit 121corresponding to the second API 124.

The reallocation of the resource allocation limits 121 may be performedresponsive to an event, predefined condition, or other criteria. In oneembodiment, resource allocation limits 121 are reallocated responsive toa resource 127 usage of a first API 124 approaching the resourceallocation limit 121 corresponding to the first API 124. This maycomprise the resource 127 usage exceeding a threshold determined as afunction of the resource allocation limit 121, the resource 127 usageequaling the resource allocation limit 121, or some other approach.Responsive to the resource 127 usage of the first API 124 approachingthe resource allocation limit 121, the resource allocation application114 will decrease the resource allocation limit 121 of a second API 124and increase the resource allocation limit 121 of the first API 124.

The second API 124 from which the resource allocation limits 121 arereallocated may be determined by the resource allocation application 114as a function of resource 127 usage with respect to the second API 124.For example, the second API 124 may comprise an API 124 whose resource127 usage is below a threshold with respect to the correspondingresource allocation limit 121. In other embodiments, the second API 124may be determined as a function of the corresponding resource allocationlimit 121 being above a minimum threshold. For example, the second API124 may be the one of the APIs 124 whose resource allocation limit 121after reallocation meets or exceeds a minimum value. Other criteria mayalso be used to determine the second API 124 from which the resourceallocation limits 121 are reallocated.

Reallocating the resource allocation limits 121 may be subject toconditions or other criteria. In some embodiments, the resourceallocation limits 121 may only be reallocated if an available system orresource 127 capacity exceeds a threshold. For example, even if theresource 127 usage of a first API 124 approaches the resource allocationlimit 121, the resource allocation limits 121 may only be reallocated ifat least twenty-five percent of the system capacity is available.

Additionally, in embodiments in which resource allocation limits 121 arereallocated from APIs 124 having resource allocation limits 121 above aminimum threshold, the resource allocation limits 121 may be reallocatedsubject to there being an API 124 having a resource allocation limit 121above the minimum threshold. Other conditions may also exist forreallocating the resource allocation limits 121.

In embodiments in which the resource allocation application 114facilitates the allocation of the resources 127 as a function of theresource allocation limits 121, the resource allocation application 114may allocate an amount of resources 127 to an API 124 above thecorresponding resource allocation limit 121 responsive to a condition orevent. For example, an amount of resources 127 allocated to an API 124may meet the corresponding resource allocation limit 121, an increasedload is being placed on the API 124, and an amount of available systemcapacity exceeds a minimum threshold. In such an example, the resourceallocation application 114 may allocate resources 127 to the API 124above the corresponding resource allocation limit 121.

The resource allocation application 114 may also throttle back resources127 allocated to an API 124 above the corresponding resource allocationlimit 121 subject to some condition or event. Such conditions mayinclude, for example, the amount of allocated resources 127 exceedingthe resource allocation limit 121 for a predefined amount of time, theamount of overall system capacity falling below a minimum threshold, orsome other event.

Services 117 comprise functionality implemented in the computingenvironment 101 to facilitate the execution of applications or otherservices 117 executed in the computing environment 101. The services 117may be executed to, for example, facilitate the processing of requests134 obtained from and communicating responses 137 to clients 104. Eachservice 117 may implement one or more APIs 124 to facilitate theiroperation. The APIs 124 may be exposed to clients 104 or otherfunctionality implemented in the computing environment 101. Each API 124corresponds to a resource allocation limit 121 establishing a maximumthreshold for resource 127 in executing calls to the API 124. Resources127 may comprise any capability that must be scheduled, assigned, orcontrolled to assure nonconflicting usage by the APIs 124. Asnon-limiting examples, resources 127 may comprise threads, processingpower, network bandwidth, disc access, input/output traffic, databaseconnections, used or allocated memory, socket connections, open sockets,or other computational resource used to facilitate the execution of API124 calls.

The data stored in the data store 111 includes, for example, usage data131, and potentially other data.

The client 104 is representative of a plurality of client devices thatmay be coupled to the network 107. The client 104 may comprise, forexample, a processor-based system such as a computer system. Such acomputer system may be embodied in the form of a desktop computer, alaptop computer, personal digital assistants, cellular telephones,smartphones, set-top boxes, music players, web pads, tablet computersystems, game consoles, electronic book readers, or other devices withlike capability.

The client 104 may be configured to execute various applications such asa client application 141 and/or other applications. The clientapplication 141 may be executed in a client 104, for example, to accessnetwork content served up by the computing environment 101 and/or otherservers. To this end, the client application 141 may comprise, forexample, a browser, a dedicated application, etc. The client 104 may beconfigured to execute applications beyond the client application 141such as, for example, email applications, social networkingapplications, word processors, spreadsheets, and/or other applications.

Next, a general description of the operation of the various componentsof the networked environment 100 is provided. To begin, clients 104communicate requests 134 to the computing environment 101. Services 117are executed to satisfy these requests 134. Satisfying the requests 134may be facilitated by APIs 124 associated with a respective one of theservices 117.

Each of the APIs 124 comprises a resource allocation limit 121establishing a maximum amount of resources 127 that may be allocated forexecuting API 124 calls. The resources 127 may comprise threads, networkbandwidth, disk access, or other computational functionality availablein the computing environment 101.

As API 124 calls are executed to satisfy the requests 134, usage data131 is aggregated by the resource allocation application 114. Usage data131 may comprise an amount of transactions per second executed withrespect to a corresponding one of the APIs 124, resource 127 consumptionor usage, and potentially other data. The usage data 131 may beassociated with a time period during which the usage data 131 wasaggregated or sampled. Satisfaction of the requests 134 may furthercomprise communicating responses 137 to the client. API 124 calls andassociated usage data 131 may be generated responsive to other events,such as internal functionality executed in the computing environment101, or by another approach.

The resource allocation application 114 then calculates the resourceallocation limits 121 of the APIs 124. The resource allocation limits121 may be calculated or recalculated responsive to some event,condition, or other criteria. For example, the event may comprise anaddition or deprecation of an API 124 to a collection of APIs 124associated with the same service 117 or shared pool of resources 127.The event may also comprise input for a user or administrator of thecomputing environment 101. A condition may comprise the computingenvironment 101 or resource 127 usage embodying a predefined state. Theresource allocation application 114 may also recalculate the resourceallocation limits 121 responsive to other criteria.

Calculating the resource allocation limit 121 for an API 124 maycomprise applying an aggregate function to that of the usage data 131associated with the API 124. For example, the resource allocationapplication 114 may apply a weighted average to the resource 127 usageembodied in the usage data 131 with respect to the API 124. The weightapplied to the usage data 131 may increase with respect to the age ofthe usage data 131 such that older usage data 131 receives a higherweight. Other functions may also be applied to the usage data 131 togenerate the resource allocation limits 121.

The resource allocation limits 121 may also be calculated as a functionof priority tiers associated with the APIs 124, or as a function ofother data.

The resource allocation application 114 may reallocate resourceallocation limits 121 with respect to a pair of APIs 124, therebyallowing one API 124 to “steal” resource allocation limits 121 fromanother API 124. Reallocating the resource allocation limits 121 may beinitiated responsive to a resource 127 usage of one API 124 approachingthe corresponding resource allocation limit 121. This may comprise theresource 127 usage equaling the resource allocation limit 121, exceedinga threshold generated with respect to the resource allocation limit 121,or meeting some other criteria. Reallocating the resource allocationlimits 121 of a pair of APIs 124 may comprise increasing the resourceallocation limit 121 of a first API 124 and decreasing the resourceallocation limit 121 of a second API 124, or another approach.

In some embodiments, resource allocation limits 121 are associated withminimum threshold values. In such embodiments, the resource allocationlimit 121 to be decreased may not be decreased to a value below theminimum threshold value. The minimum threshold value may be defined withrespect to the corresponding API 124, applied to all APIs 124, or asubset of APIs 124.

Reallocating the resource allocation limits 121 may be performed subjectto a predefined condition. For example, the resource allocationapplication 114 may perform a resource allocation limit 121 reallocationsubject to an overall system capacity of the computing environment 101or an available resource 127 capacity exceeding a minimum threshold.Additionally, the reallocation may be performed subject to there beingat least one API whose resource allocation limit 121 exceeds a minimumthreshold value.

In some embodiments, the resource allocation application 114 maycalculate, recalculate, reallocate, or modify the resource allocationlimits 121 subject to a maximum change threshold. The maximum changethreshold embodies an amount by which a resource allocation limit 121may be modified. The maximum change threshold may be defined withrespect to a period of time. For example, a maximum change threshold maydictate that a resource allocation limit 121 may not be changed by morethan ten percent of an initial value per day. The maximum changethreshold may also be enforced by another approach.

After the resource allocation limits 121 have been calculated,recalculated, reallocated, or otherwise modified, the resourceallocation application 114 may then modify the resources 127 allocatedto the APIs 124 to reflect modified resource allocation limits 121. Forexample, if an amount of allocated thread resources 127 is greater thana subsequently calculated resource allocation limit 121, the resourceallocation application 114 may initiate a termination of a subset of thethreads allocated to the respective API 124. As another example, an API124 whose resource allocation limit 121 is increased may have additionalthreads created to facilitate completion of the respective API 124calls. Other actions may also be taken in response to the resourceallocation application 114 modifying the resource allocation limits 121.

In some embodiments, the resource allocation application 114 mayincrease an amount of resources 127 allocated to an API 124 above thecorresponding resource allocation limit 121 subject to a condition orevent. For example, such conditions may include an increased load beingplaced on an API 124 whose allocated resources 127 meet thecorresponding resource allocation limit, and an overall available systemcapacity exceeding a threshold. Other events or conditions may alsotrigger an allocation of resources 127 above a resource allocation limit121.

If an amount of resources 127 allocated to an API 124 is above thecorresponding resource allocation limit 121, the resource allocationapplication 114 may throttle back the amount of allocated resources 127to meet or fall below the corresponding resource allocation limit 121responsive to some event or condition. For example, such a condition maycomprise an amount of resources 127 being allocated above thecorresponding resource allocation limit 121 for a predefined amount oftime. Such a condition may also comprise an amount of available systemcapacity falling below a threshold. Other conditions or events may alsotrigger a throttling back of an amount of allocated resources 127 tomeet or fall below a corresponding resource allocation limit 121.

Referring next to FIG. 2, shown is a flowchart that provides one exampleof the operation of a portion of the resource allocation application 114(FIG. 1) according to various embodiments. It is understood that theflowchart of FIG. 2 provides merely an example of the many differenttypes of functional arrangements that may be employed to implement theoperation of the portion of the resource allocation application 114 asdescribed herein. As an alternative, the flowchart of FIG. 2 may beviewed as depicting an example of steps of a method implemented in thecomputing environment 101 (FIG. 1) according to one or more embodiments.

Beginning with box 201, the resource allocation application 114generates usage data 131 (FIG. 1) samples for a set of APIs 124 (FIG.1). Generating the usage data 131 samples may comprise querying a datastore 111 (FIG. 1) storing a collection of usage data 131. This may alsocomprise querying log data or other data maintained with respect to theAPIs 124. Generating the usage data 131 samples may also be performed byanother approach.

Next, in box 204, the resource allocation application 114 calculates aweighted average of the usage data 131 samples. This may compriseapplying a weight to the usage data 131 that increases with the age ofthe usage data 131, or by another approach. In box 207, the resourceallocation application 114 calculates the resource allocation limits 121(FIG. 1) for each of the APIs 124. This may be performed as a functionof the weighted average of the usage data 131 corresponding to arespective one of the APIs 124. This may also be performed as a functionof a priority tier associated with the APIs 124, or by another approach.

In box 211, the resources 127 (FIG. 1) are reallocated as a function ofthe resource allocation limits 121. This may comprise decreasing anamount of resources 127 allocated to an API 124 whose resourceallocation limit 121 was decreased, or another action.

In box 214, the resource allocation application 114 waits until a newAPI 124 has been added to the collection of APIs 124. When the API isadded, the process moves to box 207, where the resource allocationlimits 121 are recalculated and the amounts of allocated resources 127adjusted in box 211.

Referring next to FIG. 3, shown is a flowchart that provides one exampleof the operation of at least a portion of the resource allocation limit121 (FIG. 1) reallocation functionality of the resource allocationapplication 114 (FIG. 1) according to various embodiments. It isunderstood that the flowchart of FIG. 3 provides merely an example ofthe many different types of functional arrangements that may be employedto implement the operation of the portion of the resource allocationapplication 114 as described herein. As an alternative, the flowchart ofFIG. 3 may be viewed as depicting an example of steps of a methodimplemented in the computing environment 101 (FIG. 1) according to oneor more embodiments.

In box 301, the resource allocation application 114 determines if theresources 127 (FIG. 1) allocated for a first API 124 (FIG. 1) isapproaching the resource allocation limit 121. This may comprisedetermining if the allocated resources 127 equals the resourceallocation limit 121, exceeds some threshold calculated with respect tothe resource allocation limit 121, or exceeds some other threshold.

If the resources 127 allocated to the first API 124 do not approach theresource allocation limit 121 the process ends. Otherwise, the processproceeds to box 304, where the resource allocation application 114determines if the overall system capacity is above a threshold. If thesystem capacity is below the threshold, the process ends. Otherwise, theprocess proceeds to box 307.

In box 307 the resource allocation application 114 determines if theresources 127 allocated to a second API 124 are above a minimum amount.The minimum may be defined with respect to the API 124, a correspondingservice 117 (FIG. 1), or with respect to an entirety or a subset of theAPIs 124. The minimum may also be defined as a function of other data.If the resources 127 allocated to the second API are at or below theminimum, the process ends. Otherwise, the process proceeds to box 311.

In box 311, the resource allocation limit 121 corresponding to the firstAPI 124 is increased. In box 314, the resource allocation limit 121corresponding to the second API 124 is increased. In box 317, resources127 allocated to the first and second API 124 are reallocated to reflectthe new resource allocation limits 121, after which the process ends.

Referring next to FIG. 4, shown is a flowchart that provides one exampleof the operation of at least a portion of the resource 127 (FIG. 1)allocation functionality of the resource allocation application 114(FIG. 1) according to various embodiments. It is understood that theflowchart of FIG. 4 provides merely an example of the many differenttypes of functional arrangements that may be employed to implement theoperation of the portion of the resource allocation application 114 asdescribed herein. As an alternative, the flowchart of FIG. 4 may beviewed as depicting an example of steps of a method implemented in thecomputing environment 101 (FIG. 1) according to one or more embodiments.

In box 401, the resource allocation application 114 determines if theamount of resources 127 allocated for an API 124 (FIG. 1) is approachingor meets the corresponding resource allocation limit 121 (FIG. 1). Thismay comprise determining if the allocated resources 127 equals theresource allocation limit 121, exceeds some threshold calculated withrespect to the resource allocation limit 121, or exceeds some otherthreshold.

If the resources 127 allocated to the API 124 do not approach or meetthe corresponding resource allocation limit 121, the process ends.Otherwise, the process proceeds to box 404, where the resourceallocation application 114 determines if the overall system capacity isabove a threshold. If the system capacity is below the threshold, theprocess ends. Otherwise, the process proceeds to box 407.

In box 407 the resource allocation application 114 increases an amountof resources 127 allocated to the API 124 to a value above thecorresponding resource allocation limit 121. In box 411, the resourceallocation application 114 determines if a throttling condition is met.The throttling condition may comprise an amount of resources 127 beingallocated to the API 124 above the corresponding resource allocationlimit 121 for a predefined amount of time, a transaction load beingplaced on the API 124 falling below a threshold, an amount of availablesystem capacity falling below a threshold, or another event. In box 414,when a throttle condition is met, the resource allocation application114 decreases the amount of resources 127 allocated to the API 124 to anamount at or below the corresponding resource allocation limit 121,after which the process ends.

With reference to FIG. 5, shown is a schematic block diagram of thecomputing environment 101 (FIG. 1) according to an embodiment of thepresent disclosure. The computing environment 101 includes one or morecomputing devices 501. Each computing device 501 includes at least oneprocessor circuit, for example, having a processor 502 and a memory 504,both of which are coupled to a local interface 507. To this end, eachcomputing device 501 may comprise, for example, at least one servercomputer or like device. The local interface 507 may comprise, forexample, a data bus with an accompanying address/control bus or otherbus structure as can be appreciated.

Stored in the memory 504 are both data and several components that areexecutable by the processor 502. In particular, stored in the memory 504and executable by the processor 502 are a resource allocationapplication 114 (FIG. 1), services 117 (FIG. 1) facilitated by resources127 (FIG. 1), and potentially other applications. Also stored in thememory 504 may be a data store 111 (FIG. 1) and other data. In addition,an operating system may be stored in the memory 504 and executable bythe processor 502.

It is understood that there may be other applications that are stored inthe memory 504 and are executable by the processor 502 as can beappreciated. Where any component discussed herein is implemented in theform of software, any one of a number of programming languages may beemployed such as, for example, C, C++, C#, Objective C, Java®,JavaScript®, Perl, PHP, Visual Basic®, Python®, Ruby, Flash®, or otherprogramming languages.

A number of software components are stored in the memory 504 and areexecutable by the processor 502. In this respect, the term “executable”means a program file that is in a form that can ultimately be run by theprocessor 502. Examples of executable programs may be, for example, acompiled program that can be translated into machine code in a formatthat can be loaded into a random access portion of the memory 504 andrun by the processor 502, source code that may be expressed in properformat such as object code that is capable of being loaded into a randomaccess portion of the memory 504 and executed by the processor 502, orsource code that may be interpreted by another executable program togenerate instructions in a random access portion of the memory 504 to beexecuted by the processor 502, etc. An executable program may be storedin any portion or component of the memory 504 including, for example,random access memory (RAM), read-only memory (ROM), hard drive,solid-state drive, USB flash drive, memory card, optical disc such ascompact disc (CD) or digital versatile disc (DVD), floppy disk, magnetictape, or other memory components.

The memory 504 is defined herein as including both volatile andnonvolatile memory and data storage components. Volatile components arethose that do not retain data values upon loss of power. Nonvolatilecomponents are those that retain data upon a loss of power. Thus, thememory 504 may comprise, for example, random access memory (RAM),read-only memory (ROM), hard disk drives, solid-state drives, USB flashdrives, memory cards accessed via a memory card reader, floppy disksaccessed via an associated floppy disk drive, optical discs accessed viaan optical disc drive, magnetic tapes accessed via an appropriate tapedrive, and/or other memory components, or a combination of any two ormore of these memory components. In addition, the RAM may comprise, forexample, static random access memory (SRAM), dynamic random accessmemory (DRAM), or magnetic random access memory (MRAM) and other suchdevices. The ROM may comprise, for example, a programmable read-onlymemory (PROM), an erasable programmable read-only memory (EPROM), anelectrically erasable programmable read-only memory (EEPROM), or otherlike memory device.

Also, the processor 502 may represent multiple processors 502 and/ormultiple processor cores and the memory 504 may represent multiplememories 504 that operate in parallel processing circuits, respectively.In such a case, the local interface 507 may be an appropriate networkthat facilitates communication between any two of the multipleprocessors 502, between any processor 502 and any of the memories 504,or between any two of the memories 504, etc. The local interface 507 maycomprise additional systems designed to coordinate this communication,including, for example, performing load balancing. The processor 502 maybe of electrical or of some other available construction.

Although the resource allocation application 114, and other varioussystems described herein may be embodied in software or code executed bygeneral purpose hardware as discussed above, as an alternative the samemay also be embodied in dedicated hardware or a combination ofsoftware/general purpose hardware and dedicated hardware. If embodied indedicated hardware, each can be implemented as a circuit or statemachine that employs any one of or a combination of a number oftechnologies. These technologies may include, but are not limited to,discrete logic circuits having logic gates for implementing variouslogic functions upon an application of one or more data signals,application specific integrated circuits (ASICs) having appropriatelogic gates, field-programmable gate arrays (FPGAs), or othercomponents, etc. Such technologies are generally well known by thoseskilled in the art and, consequently, are not described in detailherein.

The flowcharts of FIGS. 2, 3, and 4 show the functionality and operationof an implementation of portions of the resource allocation application114. If embodied in software, each block may represent a module,segment, or portion of code that comprises program instructions toimplement the specified logical function(s). The program instructionsmay be embodied in the form of source code that comprises human-readablestatements written in a programming language or machine code thatcomprises numerical instructions recognizable by a suitable executionsystem such as a processor 502 in a computer system or other system. Themachine code may be converted from the source code, etc. If embodied inhardware, each block may represent a circuit or a number ofinterconnected circuits to implement the specified logical function(s).

Although the flowcharts of FIGS. 2, 3, and 4 show a specific order ofexecution, it is understood that the order of execution may differ fromthat which is depicted. For example, the order of execution of two ormore blocks may be scrambled relative to the order shown. Also, two ormore blocks shown in succession in FIGS. 2, 3, and 4 may be executedconcurrently or with partial concurrence. Further, in some embodiments,one or more of the blocks shown in FIGS. 2, 3, and 4 may be skipped oromitted. In addition, any number of counters, state variables, warningsemaphores, or messages might be added to the logical flow describedherein, for purposes of enhanced utility, accounting, performancemeasurement, or providing troubleshooting aids, etc. It is understoodthat all such variations are within the scope of the present disclosure.

Also, any logic or application described herein, including the resourceallocation application 114, that comprises software or code can beembodied in any non-transitory computer-readable medium for use by or inconnection with an instruction execution system such as, for example, aprocessor 502 in a computer system or other system. In this sense, thelogic may comprise, for example, statements including instructions anddeclarations that can be fetched from the computer-readable medium andexecuted by the instruction execution system. In the context of thepresent disclosure, a “computer-readable medium” can be any medium thatcan contain, store, or maintain the logic or application describedherein for use by or in connection with the instruction executionsystem.

The computer-readable medium can comprise any one of many physical mediasuch as, for example, magnetic, optical, or semiconductor media. Morespecific examples of a suitable computer-readable medium would include,but are not limited to, magnetic tapes, magnetic floppy diskettes,magnetic hard drives, memory cards, solid-state drives, USB flashdrives, or optical discs. Also, the computer-readable medium may be arandom access memory (RAM) including, for example, static random accessmemory (SRAM) and dynamic random access memory (DRAM), or magneticrandom access memory (MRAM). In addition, the computer-readable mediummay be a read-only memory (ROM), a programmable read-only memory (PROM),an erasable programmable read-only memory (EPROM), an electricallyerasable programmable read-only memory (EEPROM), or other type of memorydevice.

It should be emphasized that the above-described embodiments of thepresent disclosure are merely possible examples of implementations setforth for a clear understanding of the principles of the disclosure.Many variations and modifications may be made to the above-describedembodiment(s) without departing substantially from the spirit andprinciples of the disclosure. All such modifications and variations areintended to be included herein within the scope of this disclosure andprotected by the following claims.

Therefore, the following is claimed:
 1. A non-transitory computer-readable medium embodying a program executable in at least one computing device, the at least one computing device having instructions that, when executed, cause the at least one computing device to at least: calculate a plurality of resource allocation limits, each of the plurality resource allocation limits corresponding to a respective one of a plurality of application program interfaces; recalculate the plurality of resource allocation limits responsive to a new application program interface being added to the plurality of application program interfaces; increase a first one of the plurality of resource allocation limits responsive to a current resource usage of one of the plurality of application program interfaces corresponding to the first one of the plurality of resource allocation limits approaching the first one of the plurality of resource allocation limits; and decrease a second one of the plurality of resource allocation limits contemporaneous to increasing the first one of the plurality of resource allocation limits.
 2. The non-transitory computer-readable medium of claim 1, wherein the plurality of resource allocation limits are calculated as a function of usage data associated with a past usage of the plurality of application program interfaces.
 3. The non-transitory computer-readable medium of claim 1, wherein the plurality of resource allocation limits comprise a plurality of thread allocation limits.
 4. A system, comprising: at least one computing device configured to at least: calculate a plurality of resource allocation limits, each of the plurality of resource allocation limits corresponding to a respective one of a plurality of application program interfaces; recalculate at least a subset of the plurality of resource allocation limits responsive to an event; and increase one of the plurality of resource allocation limits responsive to a current usage of one of the plurality of application program interfaces approaching the one of the plurality of resource allocation limits.
 5. The system of claim 4, wherein the at least a subset of the plurality of resource allocation limits are recalculated as a function of a maximum allowable resource allocation limit change.
 6. The system of claim 4, wherein the plurality of resource allocation limits is calculated based at least in part on usage data associated with a past usage of the plurality of application program interfaces.
 7. The system of claim 4, wherein the one of the plurality of resource allocation limits is a first one of the plurality of resource allocation limits, and the at least one computing device is further configured to at least decrease a second another one of the plurality of resource allocation limits contemporaneous to increasing the first one of the plurality of resource allocation limits.
 8. The system of claim 7, wherein the first one of the plurality of resource allocation limits is increased and the second one of the plurality of resource allocation limits is decreased responsive to an overall system capacity exceeding a threshold.
 9. The system of claim 7, wherein the method further comprises selecting the second one of the plurality of resource allocation limits responsive to the second one of the plurality of resource allocation limits being above a minimum threshold.
 10. The system of claim 7, wherein the at least one computing device is further configured to at least select the second one of the plurality of resource allocation limits corresponding to a second one of the plurality of application program interfaces responsive to a current resource usage of the second one of the plurality of application program interfaces falling below the second one of the plurality of resource allocation limits.
 11. The system of claim 4, wherein the plurality of resource allocation limits comprise a maximum number of threads allocated to respective ones of the plurality of application program interfaces.
 12. The system of claim 4, wherein the plurality of resource allocation limits comprise at least one of an amount of processing power, an amount of network bandwidth, an amount of disc access, or an amount of input/output traffic allocated to respective ones of the plurality of application program interfaces.
 13. The system of claim 4, wherein the event comprises an addition or deprecation of one of the application program interfaces to the plurality of application program interfaces, or a passage of a predefined interval.
 14. A method, comprising: calculating, in at least one computing device, a plurality of resource allocation limits, each of the plurality of resource allocation limits corresponding to a respective one of a plurality of application program interfaces; and recalculating, in the at least one computing device, at least a subset of the plurality of resource allocation limits responsive to a satisfaction of a predefined condition by: increasing a first one of the plurality of resource allocation limits; and decreasing a second one of the plurality of resource allocation limits.
 15. The method of claim 14, wherein the predefined condition comprises a current usage of one of the plurality of application program interfaces approaching a corresponding one of the plurality of resource allocation limits.
 16. The method of claim 14, wherein the predefined condition comprises a passage of a predefined interval.
 17. The method of claim 14, wherein recalculating the at least a subset of the plurality of resource allocation limits comprises increasing at least one of the plurality of resource allocation limits in response to an amount of available system capacity meeting a predefined threshold.
 18. The method of claim 14, further comprising selecting the second one of the plurality of resource allocation limits responsive to the second one of the plurality of resource allocation limits meeting a minimum resource allocation threshold.
 19. The method of claim 14, wherein the predefined condition comprises a resource usage of one of the plurality of application program interfaces approaching the first one of the plurality of resource allocation limits.
 20. The method of claim 14, wherein the predefined condition comprises an addition or a deprecation of one of the plurality of application program interfaces. 